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 30, 2026 19:46Josu San MartinJosu San MartinScore: 9,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:468,98683,090,27873,543,0001,047,0002,113,536
2Aug 30, 2026 19:469,00283,137,63673,690,0001,027,0002,113,536
3Aug 30, 2026 19:469,00383,226,80873,672,0001,056,0002,113,536
4Aug 30, 2026 19:469,01083,196,88373,739,0001,048,0002,113,536
5Aug 30, 2026 19:469,04183,430,17174,017,0001,026,0002,113,536
6Aug 30, 2026 19:469,04383,599,97473,940,0001,117,0002,113,536
7Aug 30, 2026 19:469,04583,559,04774,045,0001,031,0002,113,536
8Aug 30, 2026 19:469,06083,698,12874,139,0001,061,0002,113,536
9Aug 30, 2026 19:469,48187,137,88577,650,0001,044,0002,113,536