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:31Victor MerckléVictor MerckléScore: 3,795Success
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:323,76239,622,53830,145,0001,086,0002,117,632stderr
2Aug 25, 2026 00:323,77339,710,82530,189,0001,135,0002,117,632stderr
3Aug 25, 2026 00:323,77439,742,09030,216,0001,109,0002,117,632stderr
4Aug 25, 2026 00:323,78639,807,73330,315,0001,112,0002,117,632stderr
5Aug 25, 2026 00:323,79539,846,02530,421,0001,082,0002,117,632stderr
6Aug 25, 2026 00:323,80140,022,94530,404,0001,148,0002,117,632stderr
7Aug 25, 2026 00:323,80341,261,75130,410,0001,156,0002,117,632stderr
8Aug 25, 2026 00:323,81040,049,26930,496,0001,133,0002,117,632stderr
9Aug 25, 2026 00:324,02942,483,46132,374,0001,071,0002,117,632stderr