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 30, 2026 18:10Josu San MartinJosu San MartinScore: 4,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:104,79948,250,17238,709,0001,129,0002,113,536
2Aug 30, 2026 18:104,79948,252,07138,700,0001,136,0002,113,536
3Aug 30, 2026 18:104,82548,514,86838,945,0001,107,0002,113,536
4Aug 30, 2026 18:104,82948,513,37038,989,0001,095,0002,113,536
5Aug 30, 2026 18:104,83148,531,37238,990,0001,114,0002,113,536
6Aug 30, 2026 18:104,83848,618,84639,019,0001,139,0002,113,536
7Aug 30, 2026 18:104,83948,658,34839,043,0001,125,0002,113,536
8Aug 30, 2026 18:104,85748,778,99939,290,0001,030,0002,113,536
9Aug 30, 2026 18:105,19051,519,70241,968,0001,112,0002,113,536