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 listJul 19, 2026 18:19Adam FolwarcznyAdam FolwarcznyScore: 8,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 18:208,57179,394,14458,551,00012,595,0002,117,632
2Jul 19, 2026 18:208,58079,255,61358,221,00012,997,0002,117,632
3Jul 19, 2026 18:208,59179,533,27958,856,00012,453,0002,117,632
4Jul 19, 2026 18:208,60079,372,12058,121,00013,263,0002,117,632
5Jul 19, 2026 18:208,68582,357,98459,287,00012,801,0002,117,632
6Jul 19, 2026 18:208,69380,117,08759,469,00012,684,0002,117,632
7Jul 19, 2026 18:208,69880,435,67259,374,00012,820,0002,117,632
8Jul 19, 2026 18:208,82281,473,25260,333,00012,893,0002,117,632
9Jul 19, 2026 18:208,88682,010,19260,952,00012,807,0002,117,632