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 listFeb 18, 2026 18:32wnwnScore: 7,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:326,41675,392,35451,242,0002,009,0002,510,848
2Feb 18, 2026 18:326,48579,783,44051,829,0001,993,0002,301,952
3Feb 18, 2026 18:326,60781,536,00554,839,00002,322,432
4Feb 18, 2026 18:327,39287,422,36358,339,0003,017,0002,387,968
5Feb 18, 2026 18:327,45985,992,82258,913,0002,995,0002,363,392
6Feb 18, 2026 18:327,46084,384,93159,924,0001,997,0002,453,504