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:25boop34boop34Score: 8,262Success
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:258,15877,570,72666,512,0001,202,0002,113,536
2Aug 4, 2026 16:258,23578,254,27867,225,0001,127,0002,113,536
3Aug 4, 2026 16:258,24178,252,44967,184,0001,223,0002,113,536
4Aug 4, 2026 16:258,26178,510,26867,378,0001,191,0002,113,536
5Aug 4, 2026 16:258,26278,408,46467,367,0001,209,0002,113,536
6Aug 4, 2026 16:258,28179,919,81767,529,0001,205,0002,113,536
7Aug 4, 2026 16:258,28378,669,56067,694,0001,055,0002,113,536
8Aug 4, 2026 16:258,32178,973,87367,841,0001,229,0002,113,536
9Aug 4, 2026 16:258,35279,283,05168,118,0001,210,0002,113,536