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 listAug 2, 2026 18:58George SeabridgeGeorge SeabridgeScore: 14,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 18:5813,790125,162,898112,256,0002,209,0002,113,536
2Aug 2, 2026 18:5813,983126,877,946113,852,0002,215,0002,113,536
3Aug 2, 2026 18:5813,993126,436,024113,872,0002,270,0002,113,536
4Aug 2, 2026 18:5814,039127,135,927114,325,0002,203,0002,113,536
5Aug 2, 2026 18:5814,178127,504,214115,484,0002,195,0002,113,536
6Aug 2, 2026 18:5814,548131,427,316118,547,0002,202,0002,113,536
7Aug 2, 2026 18:5814,801133,532,047120,658,0002,197,0002,113,536
8Aug 2, 2026 18:5814,848133,835,643121,039,0002,205,0002,113,536
9Aug 2, 2026 18:5815,240137,101,592124,309,0002,187,0002,113,536