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 12, 2026 06:20Victor MerckléVictor MerckléScore: 4,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:204,73847,675,08738,237,0001,094,0002,117,632stderr
2Aug 12, 2026 06:204,75147,716,02438,329,0001,106,0002,117,632stderr
3Aug 12, 2026 06:204,75747,763,84538,394,0001,091,0002,117,632stderr
4Aug 12, 2026 06:204,75847,793,01138,360,0001,136,0002,117,632stderr
5Aug 12, 2026 06:204,77247,993,79938,537,0001,074,0002,117,632stderr
6Aug 12, 2026 06:204,79148,116,98638,693,0001,073,0002,117,632stderr
7Aug 12, 2026 06:204,79949,414,35038,736,0001,102,0002,117,632stderr
8Aug 12, 2026 06:204,80648,195,93538,857,0001,036,0002,117,632stderr
9Aug 12, 2026 06:204,91549,835,87839,662,0001,138,0002,117,632stderr