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 listMar 29, 2026 18:59Danylo MocherniukDanylo MocherniukScore: 10,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 18:5910,400109,633,72685,316,0001,003,0002,293,760
2Mar 29, 2026 18:5910,429111,827,47385,554,0001,006,0002,293,760
3Mar 29, 2026 18:5910,508117,525,84686,214,0001,002,0002,293,760
4Mar 29, 2026 18:5910,518108,664,28287,298,00002,293,760
5Mar 29, 2026 18:5910,529109,803,48386,387,0001,004,0002,498,560
6Mar 29, 2026 18:5910,529109,398,45787,392,00002,506,752
7Mar 29, 2026 18:5910,531113,160,26785,401,0002,009,0002,510,848
8Mar 29, 2026 18:5910,532109,818,32386,412,0001,004,0002,293,760
9Mar 29, 2026 18:5910,540109,995,46687,484,00002,293,760