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 listApr 21, 2026 04:19olliecrowolliecrowScore: 16,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 04:1915,900155,539,137127,972,0003,999,0002,342,912
2Apr 21, 2026 04:1915,918159,470,538126,119,0006,005,0002,363,392
3Apr 21, 2026 04:1915,934156,585,132126,247,0006,011,0002,433,024
4Apr 21, 2026 04:1916,022160,521,203124,985,0007,999,0002,338,816
5Apr 21, 2026 04:1916,025157,555,768129,015,0004,000,0002,387,968
6Apr 21, 2026 04:1916,075156,545,583128,411,0005,016,0002,347,008
7Apr 21, 2026 04:1916,153158,526,421129,070,0005,002,0002,334,720
8Apr 21, 2026 04:1916,154164,416,396128,083,0006,003,0002,342,912
9Apr 21, 2026 04:1916,379160,461,983130,951,0004,998,0002,347,008