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 listApr 27, 2026 10:01wnwnScore: 4,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:024,54954,673,91536,737,0001,020,0002,478,080
2Apr 27, 2026 10:024,55052,286,26535,782,0001,987,0002,478,080
3Apr 27, 2026 10:024,55155,852,69136,783,000994,0002,490,368
4Apr 27, 2026 10:024,65357,888,62837,610,0001,016,0002,490,368
5Apr 27, 2026 10:024,65959,145,58737,658,0001,017,0002,486,272
6Apr 27, 2026 10:024,66455,475,51337,695,0001,018,0002,330,624
7Apr 27, 2026 10:024,75658,151,21739,475,00002,486,272
8Apr 27, 2026 10:024,80658,583,78937,900,0001,994,0002,486,272
9Apr 27, 2026 10:024,92762,390,63238,903,0001,995,0002,482,176