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 listSep 23, 2026 07:45Kevin HeaveyKevin HeaveyScore: 3,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:493,32336,439,48326,453,0001,135,0002,113,536
2Sep 23, 2026 07:493,34237,114,25826,549,0001,196,0002,113,536
3Sep 23, 2026 07:493,34936,532,44226,669,0001,135,0002,113,536
4Sep 23, 2026 07:493,35737,400,25926,837,0001,030,0002,113,536
5Sep 23, 2026 07:493,36538,977,76926,871,0001,063,0002,113,536
6Sep 23, 2026 07:493,36736,807,33426,931,0001,020,0002,113,536
7Sep 23, 2026 07:493,37337,981,05226,947,0001,055,0002,113,536
8Sep 23, 2026 07:493,38436,932,66627,026,0001,063,0002,113,536
9Sep 23, 2026 07:493,38737,677,01027,077,0001,036,0002,113,536