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 20, 2026 06:41M-RochatM-RochatScore: 64,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:4164,621547,941,880535,355,0001,001,0002,113,536
2May 20, 2026 06:4164,623547,551,177535,376,0001,003,0002,113,536
3May 20, 2026 06:4164,623545,695,914535,375,0001,002,0002,113,536
4May 20, 2026 06:4164,625547,216,601535,390,0001,002,0002,113,536
5May 20, 2026 06:4164,625545,747,981535,388,0001,003,0002,113,536
6May 20, 2026 06:4164,625548,650,967535,394,0001,001,0002,113,536
7May 20, 2026 06:4164,628545,687,198535,415,0001,003,0002,113,536
8May 20, 2026 06:4164,651546,337,667535,601,0001,003,0002,113,536
9May 20, 2026 06:4164,660546,943,661535,684,0001,002,0002,113,536