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 listMay 4, 2026 23:48olliecrowolliecrowScore: 15,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:4815,209142,916,165124,007,0002,230,0002,306,048
2May 4, 2026 23:4815,316146,430,949124,831,0002,292,0002,519,040
3May 4, 2026 23:4815,336143,527,131125,022,0002,269,0002,531,328
4May 4, 2026 23:4815,434144,744,004125,885,0002,224,0002,506,752
5May 4, 2026 23:4815,464142,551,107125,307,0003,049,0002,453,504
6May 4, 2026 23:4815,468144,132,007126,163,0002,229,0002,519,040
7May 4, 2026 23:4815,480145,475,953125,441,0003,044,0002,375,680
8May 4, 2026 23:4815,484144,800,932126,489,0002,035,0002,486,272
9May 4, 2026 23:4815,777147,692,285128,929,0002,028,0002,473,984