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 28, 2026 21:48Victor MerckléVictor MerckléScore: 3,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:483,74540,621,26829,923,0001,161,0002,117,632stderr
2Aug 28, 2026 21:483,76239,436,99230,083,0001,149,0002,117,632stderr
3Aug 28, 2026 21:483,77040,391,03630,136,0001,159,0002,117,632stderr
4Aug 28, 2026 21:483,77539,618,38530,250,0001,083,0002,117,632stderr
5Aug 28, 2026 21:483,79240,523,67630,322,0001,153,0002,117,632stderr
6Aug 28, 2026 21:483,79239,672,38230,358,0001,116,0002,117,632stderr
7Aug 28, 2026 21:483,80039,678,06730,414,0001,127,0002,117,632stderr
8Aug 28, 2026 21:483,81639,886,23030,497,0001,177,0002,117,632stderr
9Aug 28, 2026 21:483,97341,304,02231,928,0001,054,0002,117,632stderr