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:01Dominique GarmierDominique GarmierScore: 7,289Success
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:017,20675,105,87556,822,0002,990,0002,342,912
2Apr 24, 2026 08:017,20872,676,59956,843,0002,991,0002,437,120
3Apr 24, 2026 08:017,23481,365,50357,041,0003,002,0002,445,312
4Apr 24, 2026 08:017,26679,456,31357,293,0003,015,0002,441,216
5Apr 24, 2026 08:017,28977,769,44658,489,0002,016,0002,441,216
6Apr 24, 2026 08:017,31982,295,68658,725,0002,025,0002,342,912
7Apr 24, 2026 08:017,32776,592,91557,827,0002,991,0002,441,216
8Apr 24, 2026 08:017,36178,804,66958,095,0003,004,0002,441,216
9Apr 24, 2026 08:017,46679,542,79258,977,0002,998,0002,437,120