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 listFeb 11, 2026 19:10olliecrowolliecrowScore: 6,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:105,95874,698,83048,440,0001,009,0002,306,048
2Feb 11, 2026 19:106,14778,474,46450,021,0001,000,0002,347,008
3Feb 11, 2026 19:106,25377,672,60048,904,0002,994,0002,408,448
4Feb 11, 2026 19:106,31182,765,75948,430,0003,953,0002,510,848
5Feb 11, 2026 19:106,32877,512,54248,483,0004,040,0002,416,640
6Feb 11, 2026 19:106,35298,184,00151,708,0001,013,0002,514,944