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 17, 2026 01:50M-RochatM-RochatScore: 16,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5016,210147,543,033132,334,0002,215,0002,113,536
2May 17, 2026 01:5016,220143,386,902132,451,0002,177,0002,113,536
3May 17, 2026 01:5016,272144,528,330131,836,0003,228,0002,113,536
4May 17, 2026 01:5016,279143,898,507132,932,0002,184,0002,113,536
5May 17, 2026 01:5016,281145,840,941132,991,0002,145,0002,113,536
6May 17, 2026 01:5016,348145,813,918132,509,0003,180,0002,113,536
7May 17, 2026 01:5016,369147,625,013132,567,0003,302,0002,113,536
8May 17, 2026 01:5016,402145,288,025133,962,0002,176,0002,113,536
9May 17, 2026 01:5016,414145,529,518134,010,0002,229,0002,113,536