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 18, 2026 13:05boop34boop34Score: 9,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:069,05784,931,21473,974,0001,203,0002,113,536
2Jul 18, 2026 13:069,06284,814,30474,003,0001,219,0002,113,536
3Jul 18, 2026 13:069,07085,027,00974,088,0001,201,0002,113,536
4Jul 18, 2026 13:069,09085,100,10274,232,0001,220,0002,113,536
5Jul 18, 2026 13:069,09485,159,12574,269,0001,216,0002,113,536
6Jul 18, 2026 13:069,11985,356,05974,551,0001,139,0002,113,536
7Jul 18, 2026 13:069,13885,558,56774,643,0001,205,0002,113,536
8Jul 18, 2026 13:069,15485,565,23574,777,0001,203,0002,113,536
9Jul 18, 2026 13:069,23586,294,07275,452,0001,205,0002,113,536