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 listMay 20, 2026 22:08Maya RebholzMaya RebholzScore: 9,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 22:099,58391,326,21277,401,0002,145,0002,113,536
2May 20, 2026 22:099,58589,145,22377,390,0002,173,0002,113,536
3May 20, 2026 22:099,58891,068,17077,414,0002,167,0002,113,536
4May 20, 2026 22:099,59290,948,40777,432,0002,183,0002,113,536
5May 20, 2026 22:099,59990,472,59777,430,0002,249,0002,113,536
6May 20, 2026 22:099,60192,697,67377,434,0002,258,0002,113,536
7May 20, 2026 22:099,60189,665,82177,430,0002,260,0002,113,536
8May 20, 2026 22:099,60191,993,99677,456,0002,235,0002,113,536
9May 20, 2026 22:099,60490,478,88177,513,0002,202,0002,113,536