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 17, 2026 09:46limanjun99limanjun99Score: 6,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 09:466,62482,709,40653,977,000999,0002,289,664
2Mar 17, 2026 09:466,63578,780,36453,072,0002,002,0002,289,664
3Mar 17, 2026 09:466,64677,449,11754,161,0001,002,0002,494,464
4Mar 17, 2026 09:466,64882,413,56953,174,0002,006,0002,502,656
5Mar 17, 2026 09:466,65480,809,65953,217,0002,008,0002,289,664
6Mar 17, 2026 09:466,65677,116,78554,239,0001,004,0002,289,664
7Mar 17, 2026 09:466,65684,763,20653,239,0002,009,0002,289,664
8Mar 17, 2026 09:466,66283,630,75453,285,0002,010,0002,289,664
9Mar 17, 2026 09:466,75579,247,77755,063,0001,001,0002,289,664