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 16, 2026 21:24wnwnScore: 8,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 21:248,16796,446,88464,792,0002,990,0002,428,928
2Feb 16, 2026 21:248,24791,197,44065,434,0003,020,0002,420,736
3Feb 16, 2026 21:248,25194,634,63065,463,0003,021,0002,396,160
4Feb 16, 2026 21:248,34292,897,53865,224,0004,013,0002,461,696
5Feb 16, 2026 21:248,35098,411,26066,291,0003,013,0002,281,472
6Feb 16, 2026 21:248,35497,877,40766,323,0003,014,0002,396,160
7Feb 16, 2026 21:248,48993,479,77768,448,0002,013,0002,445,312
8Feb 16, 2026 21:248,49495,110,27969,496,0001,007,0002,416,640
9Feb 16, 2026 21:248,530107,010,50168,803,0001,994,0002,469,888