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 listFeb 18, 2026 19:18wnwnScore: 7,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 19:187,23878,696,82757,069,0003,003,0002,420,736
2Feb 18, 2026 19:187,26882,087,07756,305,0004,021,0002,465,792
3Feb 18, 2026 19:227,28490,354,87057,433,0003,022,0002,424,832
4Feb 18, 2026 19:227,38780,155,63859,302,0002,010,0002,433,024
5Feb 18, 2026 19:227,44888,819,42758,831,0002,991,0002,404,352
6Feb 18, 2026 19:187,48686,168,49258,125,0004,008,0002,387,968