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 listOct 5, 2026 02:00FrederickFrederickScore: 8,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:018,44181,272,48368,023,0002,042,0002,117,632
2Oct 5, 2026 02:018,58981,782,09869,288,0002,006,0002,117,632
3Oct 5, 2026 02:018,61281,968,15869,476,0002,004,0002,117,632
4Oct 5, 2026 02:018,68882,666,91270,079,0002,035,0002,117,632
5Oct 5, 2026 02:018,73683,719,95670,465,0002,047,0002,117,632
6Oct 5, 2026 02:018,75183,162,95270,590,0002,044,0002,117,632
7Oct 5, 2026 02:018,76983,285,58270,765,0002,018,0002,117,632
8Oct 5, 2026 02:018,92684,528,78472,051,0002,035,0002,117,632
9Oct 5, 2026 02:018,94085,330,34872,136,0002,073,0002,117,632