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 25, 2026 16:16Kenzie_RTKenzie_RTScore: 68,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:1767,451571,296,776558,841,0001,005,0002,113,536
2May 25, 2026 16:1767,958573,892,902562,876,0001,176,0002,113,536
3May 25, 2026 16:1768,403578,115,398566,631,0001,120,0002,113,536
4May 25, 2026 16:1768,562582,703,561567,957,0001,115,0002,113,536
5May 25, 2026 16:1768,617580,879,004568,346,0001,176,0002,113,536
6May 25, 2026 16:1768,617579,249,312568,389,0001,137,0002,113,536
7May 25, 2026 16:1768,623579,922,157568,401,0001,177,0002,113,536
8May 25, 2026 16:1768,657579,434,496568,718,0001,139,0002,113,536
9May 25, 2026 16:1768,717580,292,375569,262,0001,094,0002,113,536