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 12:06shartgepettoshartgepettoScore: 7,280Success
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 12:067,20384,446,43355,796,0003,985,0002,498,560
2Mar 17, 2026 12:067,20586,876,81754,818,0004,983,0002,473,984
3Mar 17, 2026 12:067,23484,470,18856,040,0004,002,0002,400,256
4Mar 17, 2026 12:067,26485,515,72957,277,0003,014,0002,260,992
5Mar 17, 2026 12:067,28087,042,17757,402,0003,021,0002,486,272
6Mar 17, 2026 12:067,32584,189,90454,819,0005,980,0002,306,048
7Mar 17, 2026 12:067,32885,316,64655,839,0004,985,0002,412,544
8Mar 17, 2026 12:067,51484,958,13258,346,0004,023,0002,494,464
9Mar 17, 2026 12:067,51589,101,26757,344,0005,030,0002,457,600