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 20, 2026 06:20M-RochatM-RochatScore: 50,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:2350,763431,403,336419,313,0002,023,0002,138,112
2May 20, 2026 06:2350,771431,848,242418,118,0003,288,0002,154,496
3May 20, 2026 06:2350,783430,683,093419,419,0002,084,0002,138,112
4May 20, 2026 06:2350,784430,480,102419,451,0002,057,0002,138,112
5May 20, 2026 06:2350,787432,167,386418,341,0003,198,0002,138,112
6May 20, 2026 06:2350,812444,267,028418,608,0003,134,0002,138,112
7May 20, 2026 06:2350,856437,585,631420,102,0002,009,0002,138,112
8May 20, 2026 06:2350,867432,130,541420,193,0002,011,0002,138,112
9May 20, 2026 06:2350,869437,026,269420,208,0002,007,0002,138,112