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 listAug 4, 2026 16:26boop34boop34Score: 8,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 16:268,18077,747,08466,709,0001,191,0002,113,536
2Aug 4, 2026 16:268,23578,957,67567,116,0001,240,0002,113,536
3Aug 4, 2026 16:268,23978,293,44067,173,0001,218,0002,113,536
4Aug 4, 2026 16:268,23978,276,15567,279,0001,107,0002,113,536
5Aug 4, 2026 16:268,24078,286,32767,274,0001,126,0002,113,536
6Aug 4, 2026 16:268,26678,521,65267,489,0001,120,0002,113,536
7Aug 4, 2026 16:268,27078,544,99267,620,0001,021,0002,113,536
8Aug 4, 2026 16:268,28678,590,43567,556,0001,221,0002,113,536
9Aug 4, 2026 16:268,36179,386,51668,187,0001,215,0002,113,536