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:39olliecrowolliecrowScore: 6,112Success
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:415,93055,803,26347,080,0002,146,0002,453,504
2May 4, 2026 23:415,94255,839,19947,195,0002,130,0002,318,336
3May 4, 2026 23:416,07657,778,26248,265,0002,167,0002,551,808
4May 4, 2026 23:416,10356,770,84448,437,0002,218,0002,342,912
5May 4, 2026 23:416,11257,213,11148,530,0002,202,0002,355,200
6May 4, 2026 23:416,11458,898,71848,486,0002,263,0002,519,040
7May 4, 2026 23:416,13357,922,54748,802,0002,107,0002,338,816
8May 4, 2026 23:416,13757,757,45248,804,0002,136,0002,322,432
9May 4, 2026 23:416,13857,373,35248,702,0002,245,0002,531,328