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 22, 2026 23:48M-RochatM-RochatScore: 6,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:496,75466,808,19054,020,0002,043,0002,113,536
2May 22, 2026 23:496,76965,553,43054,132,0002,055,0002,113,536
3May 22, 2026 23:496,77767,663,82554,106,0002,147,0002,113,536
4May 22, 2026 23:496,84068,380,45054,719,0002,055,0002,113,536
5May 22, 2026 23:496,86867,114,24154,838,0002,172,0002,113,536
6May 22, 2026 23:496,87067,112,02354,869,0002,158,0002,113,536
7May 22, 2026 23:496,88066,526,31154,959,0002,151,0002,113,536
8May 22, 2026 23:496,89067,679,25555,040,0002,152,0002,113,536
9May 22, 2026 23:496,90567,856,60455,147,0002,167,0002,113,536