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 27, 2026 02:55Victor MerckléVictor MerckléScore: 4,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:554,09643,026,90832,834,0001,164,0002,117,632stderr
2Aug 27, 2026 02:554,11342,522,11933,044,0001,097,0002,117,632stderr
3Aug 27, 2026 02:554,12042,575,47633,120,0001,079,0002,117,632stderr
4Aug 27, 2026 02:554,12043,041,66733,100,0001,102,0002,117,632stderr
5Aug 27, 2026 02:554,22643,546,22933,960,0001,116,0002,117,632stderr
6Aug 27, 2026 02:554,24643,702,28634,121,0001,129,0002,117,632stderr
7Aug 27, 2026 02:554,24844,328,70734,171,0001,092,0002,117,632stderr
8Aug 27, 2026 02:554,25043,667,77634,198,0001,077,0002,117,632stderr
9Aug 27, 2026 02:554,34444,439,65334,979,0001,081,0002,117,632stderr