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 listSep 21, 2026 17:52C21C21Score: 20,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:5419,535172,624,285160,956,0001,190,0002,113,536
2Sep 21, 2026 17:5419,673174,468,372162,045,0001,243,0002,113,536
3Sep 21, 2026 17:5419,769174,491,579162,850,0001,234,0002,113,536
4Sep 21, 2026 17:5420,062176,992,898165,286,0001,232,0002,113,536
5Sep 21, 2026 17:5420,078177,101,652165,406,0001,243,0002,113,536
6Sep 21, 2026 17:5420,079177,169,155165,410,0001,246,0002,113,536
7Sep 21, 2026 17:5420,080177,075,395165,658,0001,009,0002,113,536
8Sep 21, 2026 17:5420,083177,135,431165,449,0001,244,0002,113,536
9Sep 21, 2026 17:5420,088179,219,145165,730,0001,007,0002,113,536