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 25, 2026 00:24Victor MerckléVictor MerckléScore: 4,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:254,40545,593,53935,464,0001,102,0002,117,632stderr
2Aug 25, 2026 00:254,46445,417,41735,977,0001,076,0002,117,632stderr
3Aug 25, 2026 00:254,46745,484,21536,002,0001,077,0002,117,632stderr
4Aug 25, 2026 00:254,46945,852,00735,946,0001,150,0002,117,632stderr
5Aug 25, 2026 00:254,47245,520,56236,038,0001,081,0002,117,632stderr
6Aug 25, 2026 00:254,48145,564,65536,115,0001,083,0002,117,632stderr
7Aug 25, 2026 00:254,53354,475,96036,449,0001,180,0002,117,632stderr
8Aug 25, 2026 00:254,62847,427,88637,360,0001,057,0002,117,632stderr
9Aug 25, 2026 00:254,68947,353,55337,811,0001,112,0002,117,632stderr