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 16, 2026 09:59C21C21Score: 12,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 10:0012,286112,401,327100,798,0001,184,0002,113,536
2Sep 16, 2026 10:0012,293112,420,937100,891,0001,149,0002,113,536
3Sep 16, 2026 10:0012,297112,926,334100,901,0001,168,0002,113,536
4Sep 16, 2026 10:0012,298112,484,172100,840,0001,238,0002,113,536
5Sep 16, 2026 10:0012,303112,895,158100,957,0001,165,0002,113,536
6Sep 16, 2026 10:0012,306113,114,746100,956,0001,187,0002,113,536
7Sep 16, 2026 10:0012,310112,671,586100,913,0001,263,0002,113,536
8Sep 16, 2026 10:0012,371113,032,309101,440,0001,243,0002,113,536
9Sep 16, 2026 10:0012,439114,300,356102,062,0001,185,0002,113,536