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 18, 2026 10:08Victor MerckléVictor MerckléScore: 6,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 10:086,72966,776,38654,824,0001,033,0002,113,536
2May 18, 2026 10:086,73466,893,02854,879,0001,016,0002,113,536
3May 18, 2026 10:086,73666,980,13554,880,0001,032,0002,113,536
4May 18, 2026 10:086,73665,104,68254,894,0001,018,0002,113,536
5May 18, 2026 10:086,73665,634,64054,888,0001,023,0002,113,536
6May 18, 2026 10:086,75565,233,08055,037,0001,031,0002,113,536
7May 18, 2026 10:086,75669,197,69455,056,0001,027,0002,113,536
8May 18, 2026 10:086,76168,187,44555,087,0001,030,0002,113,536
9May 18, 2026 10:086,77867,425,18355,224,0001,038,0002,113,536