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 listMar 15, 2026 19:50Eric CeglieEric CeglieScore: 8,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:528,89798,362,70072,850,000997,0002,289,664
2Mar 15, 2026 19:508,90298,648,18670,893,0002,995,0002,314,240
3Mar 15, 2026 19:528,90596,335,20270,915,0002,996,0002,478,080
4Mar 15, 2026 19:508,90796,357,52170,935,0002,997,0002,314,240
5Mar 15, 2026 19:508,91898,819,87772,017,0002,000,0002,289,664
6Mar 15, 2026 19:529,03599,209,75672,993,0001,999,0002,301,952