Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 24, 2026 23:35Victor MerckléVictor MerckléScore: 3,965Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:363,91940,941,04031,417,0001,115,0002,117,632stderr
2Aug 24, 2026 23:363,92141,013,52931,359,0001,188,0002,117,632stderr
3Aug 24, 2026 23:363,93941,089,23431,570,0001,124,0002,117,632stderr
4Aug 24, 2026 23:363,95041,196,58131,639,0001,148,0002,117,632stderr
5Aug 24, 2026 23:363,96541,266,71031,765,0001,145,0002,117,632stderr
6Aug 24, 2026 23:363,99141,525,13832,087,0001,041,0002,117,632stderr
7Aug 24, 2026 23:363,99341,523,19032,091,0001,056,0002,117,632stderr
8Aug 24, 2026 23:364,05542,134,15832,507,0001,156,0002,117,632stderr
9Aug 24, 2026 23:364,09942,753,17933,007,0001,018,0002,117,632stderr