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 12, 2026 03:56Josu San MartinJosu San MartinScore: 3,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 03:573,86339,352,74930,950,0001,119,0002,113,536
2May 12, 2026 03:573,86841,673,58731,040,0001,071,0002,113,536
3May 12, 2026 03:573,87340,815,44531,056,0001,096,0002,113,536
4May 12, 2026 03:573,88240,290,89931,132,0001,091,0002,113,536
5May 12, 2026 03:573,88539,825,06131,168,0001,078,0002,113,536
6May 12, 2026 03:573,89339,668,69531,238,0001,079,0002,113,536
7May 12, 2026 03:573,89940,272,20331,289,0001,076,0002,113,536
8May 12, 2026 03:573,90841,939,40231,331,0001,109,0002,113,536
9May 12, 2026 03:573,92540,012,02831,502,0001,082,0002,113,536