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 24, 2026 20:15Victor MerckléVictor MerckléScore: 4,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:164,32744,357,13834,808,0001,109,0002,117,632stderr
2Aug 24, 2026 20:164,34244,222,55534,917,0001,125,0002,117,632stderr
3Aug 24, 2026 20:164,34544,453,32134,873,0001,191,0002,117,632stderr
4Aug 24, 2026 20:164,34845,150,34934,930,0001,161,0002,117,632stderr
5Aug 24, 2026 20:164,34844,318,33734,960,0001,135,0002,117,632stderr
6Aug 24, 2026 20:164,35844,604,98735,097,0001,079,0002,117,632stderr
7Aug 24, 2026 20:164,36744,618,37935,179,0001,069,0002,117,632stderr
8Aug 24, 2026 20:164,38544,576,54135,297,0001,102,0002,117,632stderr
9Aug 24, 2026 20:164,52845,979,86936,537,0001,047,0002,117,632stderr