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 17, 2026 23:47flavio87flavio87Score: 4,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 23:523,96345,929,58731,772,0001,129,0002,113,536
2Aug 17, 2026 23:524,04450,624,55832,453,0001,114,0002,113,536
3Aug 17, 2026 23:524,05150,167,03832,553,0001,078,0002,113,536
4Aug 17, 2026 23:524,05951,755,97632,548,0001,145,0002,113,536
5Aug 17, 2026 23:524,08051,525,62132,753,0001,116,0002,113,536
6Aug 17, 2026 23:524,09351,545,86032,966,0001,014,0002,113,536
7Aug 17, 2026 23:524,12575,647,98333,133,0001,107,0002,113,536
8Aug 17, 2026 23:524,13747,546,54433,321,0001,018,0002,113,536
9Aug 17, 2026 23:524,16861,530,23533,580,0001,019,0002,113,536