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 20:56Sergey SerebryakovSergey SerebryakovScore: 7,042Success
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 20:566,99180,096,09856,027,0002,000,0002,449,408
2Mar 17, 2026 20:567,00082,299,76956,099,0002,003,0002,277,376
3Mar 17, 2026 20:567,00481,125,30556,133,0002,004,0002,277,376
4Mar 17, 2026 20:567,03790,746,47357,399,0001,007,0002,437,120
5Mar 17, 2026 20:567,04279,409,32457,438,0001,007,0002,441,216
6Mar 17, 2026 20:567,04680,363,39457,472,0001,008,0002,437,120
7Mar 17, 2026 20:567,04789,801,96358,487,00002,449,408
8Mar 17, 2026 20:567,08595,388,63657,807,000996,0002,277,376
9Mar 17, 2026 20:567,09285,942,31257,863,000997,0002,523,136