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 11, 2026 19:11Victor MerckléVictor MerckléScore: 20,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 19:1520,442179,765,559164,062,0005,614,00024,576stderr
2Sep 11, 2026 19:1520,544179,827,410165,026,0005,496,00024,576stderr
3Sep 11, 2026 19:1520,547179,251,479163,791,0006,755,0002,121,728stderr
4Sep 11, 2026 19:1520,567180,011,349165,223,0005,486,00024,576stderr
5Sep 11, 2026 19:1520,586180,210,127165,338,0005,527,00024,576stderr
6Sep 11, 2026 19:1520,594179,685,487164,037,0006,894,0002,121,728stderr
7Sep 11, 2026 19:1520,595179,699,692165,427,0005,513,00024,576stderr
8Sep 11, 2026 19:1520,595180,885,218165,041,0005,903,00024,576stderr
9Sep 11, 2026 19:1520,628180,592,313165,761,0005,458,00024,576stderr