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 listJun 30, 2026 11:15Victor MerckléVictor MerckléScore: 4,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 11:164,23242,819,17333,987,0001,144,0002,117,632stderr
2Jun 30, 2026 11:164,24043,028,03634,086,0001,114,0002,117,632stderr
3Jun 30, 2026 11:164,24543,143,98534,134,0001,107,0002,117,632stderr
4Jun 30, 2026 11:164,25543,112,42534,281,0001,037,0002,117,632stderr
5Jun 30, 2026 11:164,25643,168,53434,307,0001,025,0002,117,632stderr
6Jun 30, 2026 11:164,26143,050,05834,335,0001,032,0002,117,632stderr
7Jun 30, 2026 11:164,29343,554,21934,563,0001,072,0002,117,632stderr
8Jun 30, 2026 11:164,30843,508,48634,672,0001,086,0002,117,632stderr
9Jun 30, 2026 11:164,31543,571,52434,734,0001,088,0002,117,632stderr