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 10, 2026 14:29Danylo MocherniukDanylo MocherniukScore: 4,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 14:294,70560,714,39136,047,0003,003,0002,396,160
2Apr 10, 2026 14:294,72167,777,60336,172,0003,014,0002,297,856
3Apr 10, 2026 14:294,72660,529,70437,218,0002,011,0002,297,856
4Apr 10, 2026 14:294,73264,904,71337,264,0002,014,0002,387,968
5Apr 10, 2026 14:294,73465,603,48836,271,0003,022,0002,490,368
6Apr 10, 2026 14:294,73571,892,31537,287,0002,015,0002,396,160
7Apr 10, 2026 14:294,75761,335,84836,446,0003,037,0002,392,064
8Apr 10, 2026 14:294,77069,583,81838,574,0001,015,0002,297,856
9Apr 10, 2026 14:294,99769,389,91639,456,0002,023,0002,297,856