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 13, 2026 18:02M-RochatM-RochatScore: 19,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:0219,549171,991,630161,238,0001,023,0002,113,536
2May 13, 2026 18:0219,632173,713,558161,788,0001,164,0002,113,536
3May 13, 2026 18:0219,694174,091,212162,428,0001,036,0002,113,536
4May 13, 2026 18:0219,713172,407,749162,583,0001,041,0002,113,536
5May 13, 2026 18:0219,715174,317,766162,594,0001,044,0002,113,536
6May 13, 2026 18:0219,724173,807,550162,670,0001,044,0002,113,536
7May 13, 2026 18:0219,750174,182,694162,894,0001,035,0002,113,536
8May 13, 2026 18:0219,839173,331,577163,646,0001,021,0002,113,536
9May 13, 2026 18:0220,276177,031,865167,273,0001,023,0002,113,536