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 29, 2026 13:18Danylo MocherniukDanylo MocherniukScore: 19,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:1819,211180,701,250158,449,0001,002,0002,293,760
2Mar 29, 2026 13:1819,211180,957,249158,449,0001,002,0002,506,752
3Mar 29, 2026 13:1819,214187,071,414158,473,0001,002,0002,506,752
4Mar 29, 2026 13:1819,215187,065,582159,488,00002,293,760
5Mar 29, 2026 13:1819,222184,798,302158,539,0001,003,0002,293,760
6Mar 29, 2026 13:1819,228184,146,165157,597,0001,994,0002,293,760
7Mar 29, 2026 13:1819,243183,767,904157,723,0001,996,0002,293,760
8Mar 29, 2026 13:1819,245192,329,320158,738,000998,0002,293,760
9Mar 29, 2026 13:1819,247184,007,651157,755,0001,996,0002,293,760