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 listSep 23, 2026 08:14Kevin HeaveyKevin HeaveyScore: 3,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:183,39236,951,60627,016,0001,139,0002,113,536
2Sep 23, 2026 08:183,39436,885,14127,038,0001,139,0002,113,536
3Sep 23, 2026 08:183,41037,878,07727,294,0001,012,0002,113,536
4Sep 23, 2026 08:183,41537,870,79427,311,0001,036,0002,113,536
5Sep 23, 2026 08:183,41537,337,76827,263,0001,082,0002,113,536
6Sep 23, 2026 08:183,41537,943,78527,331,0001,015,0002,113,536
7Sep 23, 2026 08:183,41637,313,22127,346,0001,014,0002,113,536
8Sep 23, 2026 08:183,42139,026,36327,358,0001,037,0002,113,536
9Sep 23, 2026 08:183,42737,327,77727,327,0001,124,0002,113,536