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 10, 2026 18:56zielajzielajScore: 3,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:573,37437,575,80226,987,0001,025,0002,113,536
2May 10, 2026 18:573,45735,933,11527,673,0001,025,0002,113,536
3May 10, 2026 18:573,47938,410,30927,848,0001,033,0002,113,536
4May 10, 2026 18:573,48838,153,63727,940,0001,011,0002,113,536
5May 10, 2026 18:573,49037,444,05227,954,0001,019,0002,113,536
6May 10, 2026 18:573,49236,970,20927,977,0001,012,0002,113,536
7May 10, 2026 18:573,50144,015,92028,017,0001,044,0002,113,536
8May 10, 2026 18:573,50237,562,98828,043,0001,031,0002,113,536
9May 10, 2026 18:573,52238,302,54428,199,0001,038,0002,113,536