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 17:33Josu San MartinJosu San MartinScore: 5,135Success
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 17:335,09953,588,57441,146,0001,180,0002,113,536
2May 10, 2026 17:335,10052,035,71741,131,0001,201,0002,113,536
3May 10, 2026 17:335,12551,961,69841,360,0001,181,0002,113,536
4May 10, 2026 17:335,13251,371,91941,422,0001,178,0002,113,536
5May 10, 2026 17:335,13551,750,41841,433,0001,192,0002,113,536
6May 10, 2026 17:335,23952,748,47542,261,0001,226,0002,113,536
7May 10, 2026 17:335,27353,308,38742,593,0001,179,0002,117,632
8May 10, 2026 17:335,32354,015,88942,989,0001,197,0002,113,536
9May 10, 2026 17:335,40854,012,38243,715,0001,176,0002,113,536