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 19, 2026 20:05wnwnScore: 5,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 20:055,06466,860,81740,030,0002,001,0002,494,464
2Feb 19, 2026 20:055,07964,829,40140,147,0002,007,0002,277,376
3Feb 19, 2026 20:055,08563,708,05340,196,0002,009,0002,277,376
4Feb 19, 2026 20:055,09167,096,72440,246,0002,012,0002,277,376
5Feb 19, 2026 20:055,12269,749,49541,503,0001,012,0002,277,376
6Feb 19, 2026 20:055,12361,036,15541,509,0001,012,0002,277,376
7Feb 19, 2026 20:055,12965,397,62141,561,0001,013,0002,535,424
8Feb 19, 2026 20:055,13768,199,51941,620,0001,015,0002,277,376
9Feb 19, 2026 20:055,21271,034,25241,246,0002,012,0002,490,368