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 24, 2026 06:16wnwnScore: 4,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:234,48246,021,80827,449,0009,757,00020,480
2Sep 24, 2026 06:234,50346,181,49827,605,0009,777,00020,480
3Sep 24, 2026 06:234,77748,410,83027,558,00012,097,00020,480
4Sep 24, 2026 06:234,78548,439,18627,732,00011,987,00020,480
5Sep 24, 2026 06:234,80148,591,50327,601,00012,250,00020,480
6Sep 24, 2026 06:235,10351,132,27927,433,00014,926,0002,113,536
7Sep 24, 2026 06:235,10851,122,59727,390,00015,014,0002,113,536
8Sep 24, 2026 06:235,13052,061,31728,878,00013,706,0002,113,536
9Sep 24, 2026 06:235,27152,539,91828,659,00015,091,0002,113,536