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 27, 2026 05:38Victor MerckléVictor MerckléScore: 10,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:4010,77997,784,87084,404,0005,067,0002,113,536
2Aug 27, 2026 05:4010,86099,128,97684,827,0005,317,0002,113,536
3Aug 27, 2026 05:4010,86198,397,97184,789,0005,363,0002,113,536
4Aug 27, 2026 05:4010,87898,599,10885,123,0005,170,0002,113,536
5Aug 27, 2026 05:4010,92298,913,47185,330,0005,326,0002,113,536
6Aug 27, 2026 05:4010,95299,097,28985,831,0005,075,0002,113,536
7Aug 27, 2026 05:4010,999100,377,32585,980,0005,315,0002,113,536
8Aug 27, 2026 05:4011,02199,645,99286,281,0005,195,0002,113,536
9Aug 27, 2026 05:4011,02299,774,06386,077,0005,412,0002,113,536