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 listSep 8, 2026 20:01Victor MerckléVictor MerckléScore: 3,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 20:023,64238,921,59829,091,0001,141,0002,117,632stderr
2Sep 8, 2026 20:023,64338,762,42329,115,0001,128,0002,117,632stderr
3Sep 8, 2026 20:023,64538,728,92929,132,0001,122,0002,117,632stderr
4Sep 8, 2026 20:023,66038,929,78129,259,0001,124,0002,117,632stderr
5Sep 8, 2026 20:023,66340,563,78229,272,0001,136,0002,117,632stderr
6Sep 8, 2026 20:023,66638,978,26229,303,0001,129,0002,117,632stderr
7Sep 8, 2026 20:023,66738,718,44129,314,0001,125,0002,117,632stderr
8Sep 8, 2026 20:023,68839,109,31229,475,0001,142,0002,117,632stderr
9Sep 8, 2026 20:023,69739,198,27429,547,0001,140,0002,117,632stderr