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 21, 2026 21:56M-RochatM-RochatScore: 6,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:566,58864,557,52552,617,0002,064,0002,113,536
2May 21, 2026 21:566,58865,377,30752,648,0002,036,0002,113,536
3May 21, 2026 21:566,59966,786,14452,705,0002,072,0002,113,536
4May 21, 2026 21:566,61267,018,97552,810,0002,071,0002,113,536
5May 21, 2026 21:566,62666,055,74852,909,0002,089,0002,113,536
6May 21, 2026 21:566,64067,072,51853,021,0002,098,0002,113,536
7May 21, 2026 21:566,69565,465,53853,519,0002,057,0002,113,536
8May 21, 2026 21:566,69866,102,26153,437,0002,164,0002,113,536
9May 21, 2026 21:566,70566,752,84953,503,0002,155,0002,113,536