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 listMar 29, 2026 09:59Danylo MocherniukDanylo MocherniukScore: 50,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 09:5950,813442,613,674419,751,0001,998,0002,510,848
2Mar 29, 2026 09:5950,824449,212,537419,838,0001,999,0002,293,760
3Mar 29, 2026 09:5950,850446,814,716420,051,0002,000,0002,510,848
4Mar 29, 2026 09:5950,861445,345,851419,143,0003,001,0002,281,472
5Mar 29, 2026 09:5950,866443,111,523421,189,0001,000,0002,281,472
6Mar 29, 2026 09:5950,866444,989,260420,184,0002,000,0002,281,472
7Mar 29, 2026 09:5950,873446,628,521419,249,0003,001,0002,281,472
8Mar 29, 2026 09:5950,876444,843,494421,274,0001,000,0002,281,472
9Mar 29, 2026 09:5950,903449,536,782419,494,0003,003,0002,293,760