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 listApr 24, 2026 08:16Dominique GarmierDominique GarmierScore: 6,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:166,76776,724,38253,165,0003,009,0002,334,720
2Apr 24, 2026 08:166,79679,874,72354,395,0002,014,0002,342,912
3Apr 24, 2026 08:166,83373,997,82254,689,0002,025,0002,342,912
4Apr 24, 2026 08:166,84676,525,56053,837,0002,990,0002,351,104
5Apr 24, 2026 08:166,84974,233,28053,858,0002,992,0002,347,008
6Apr 24, 2026 08:166,85973,870,91153,938,0002,996,0002,441,216
7Apr 24, 2026 08:166,93278,565,61456,530,0001,009,0002,347,008
8Apr 24, 2026 08:166,93377,833,68255,526,0002,019,0002,359,296
9Apr 24, 2026 08:166,95880,332,90154,768,0002,987,0002,355,200