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 listAug 1, 2026 23:02TonyTonyScore: 35,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:0235,130301,492,944290,579,0001,005,0002,113,536
2Aug 1, 2026 23:0235,135301,552,126290,615,0001,006,0002,113,536
3Aug 1, 2026 23:0235,144301,991,598290,699,0001,003,0002,113,536
4Aug 1, 2026 23:0235,149301,606,000290,738,0001,004,0002,113,536
5Aug 1, 2026 23:0235,150301,689,098290,748,0001,003,0002,113,536
6Aug 1, 2026 23:0235,151301,687,864290,753,0001,004,0002,113,536
7Aug 1, 2026 23:0235,152301,754,237290,763,0001,005,0002,113,536
8Aug 1, 2026 23:0235,152301,768,999290,763,0001,004,0002,113,536
9Aug 1, 2026 23:0235,159301,772,015290,818,0001,003,0002,113,536