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 23, 2026 00:01M-RochatM-RochatScore: 6,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 00:026,54563,579,86853,313,0001,015,0002,113,536
2May 23, 2026 00:026,54763,673,17353,329,0001,015,0002,113,536
3May 23, 2026 00:026,56163,664,37153,434,0001,030,0002,113,536
4May 23, 2026 00:026,56363,820,05953,464,0001,016,0002,113,536
5May 23, 2026 00:026,58764,740,84453,658,0001,016,0002,113,536
6May 23, 2026 00:026,60564,062,03353,810,0001,016,0002,113,536
7May 23, 2026 00:026,62065,217,31153,930,0001,017,0002,113,536
8May 23, 2026 00:026,66365,862,54254,293,0001,017,0002,113,536
9May 23, 2026 00:026,69166,509,31654,522,0001,017,0002,113,536