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 20, 2026 23:19Andrew EpsteinAndrew EpsteinScore: 10,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2026 23:1910,34295,573,88674,467,00011,373,0002,117,632
2Aug 20, 2026 23:1910,42296,211,41675,155,00011,350,0002,117,632
3Aug 20, 2026 23:1910,48296,637,16275,604,00011,401,0002,113,536
4Aug 20, 2026 23:1910,51296,986,26975,917,00011,338,0002,113,536
5Aug 20, 2026 23:1910,64098,032,19777,000,00011,312,0002,117,632
6Aug 20, 2026 23:1910,66798,271,33177,546,00010,993,0002,113,536
7Aug 20, 2026 23:1910,77599,264,54878,234,00011,202,0002,113,536
8Aug 20, 2026 23:1910,79499,351,91578,172,00011,422,0002,117,632
9Aug 20, 2026 23:1910,86399,896,14978,576,00011,591,0002,113,536