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 22:57Victor MerckléVictor MerckléScore: 7,585Success
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 22:577,57870,657,85462,899,00002,113,536
2May 13, 2026 22:577,58170,319,11062,930,00002,113,536
3May 13, 2026 22:577,58272,682,07762,931,00002,113,536
4May 13, 2026 22:577,58370,453,43561,901,0001,044,0002,113,536
5May 13, 2026 22:577,58570,243,19961,951,0001,007,0002,113,536
6May 13, 2026 22:577,58872,200,84261,946,0001,038,0002,113,536
7May 13, 2026 22:577,59073,652,38461,986,0001,015,0002,113,536
8May 13, 2026 22:577,59273,355,32562,009,0001,005,0002,113,536
9May 13, 2026 22:577,59471,195,80962,003,0001,030,0002,113,536