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 listOct 1, 2026 08:17Karthik ReddyKarthik ReddyScore: 3,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 08:183,35136,642,20426,719,0001,097,0002,113,536
2Oct 1, 2026 08:183,35736,862,09626,785,0001,081,0002,113,536
3Oct 1, 2026 08:183,36536,834,29826,834,0001,103,0002,113,536
4Oct 1, 2026 08:183,37037,055,36226,898,0001,081,0002,113,536
5Oct 1, 2026 08:183,37036,972,81626,901,0001,078,0002,113,536
6Oct 1, 2026 08:183,37337,069,19626,863,0001,140,0002,113,536
7Oct 1, 2026 08:183,39437,208,54726,994,0001,180,0002,113,536
8Oct 1, 2026 08:183,39937,122,19627,046,0001,169,0002,113,536
9Oct 1, 2026 08:183,41737,469,77227,350,0001,015,0002,113,536