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 listJul 17, 2026 20:16Kevin HeaveyKevin HeaveyScore: 3,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 20:353,65941,539,69429,321,0001,051,0002,113,536
2Jul 17, 2026 20:353,67140,307,80729,411,0001,060,0002,113,536
3Jul 17, 2026 20:353,69140,526,72429,596,0001,045,0002,113,536
4Jul 17, 2026 20:353,69740,522,01329,642,0001,048,0002,113,536
5Jul 17, 2026 20:353,74740,916,98430,054,0001,047,0002,113,536
6Jul 17, 2026 20:353,86743,441,26531,056,0001,043,0002,113,536
7Jul 17, 2026 20:353,87241,923,79631,096,0001,045,0002,113,536
8Jul 17, 2026 20:353,87343,254,64331,106,0001,042,0002,113,536
9Jul 17, 2026 20:353,88442,098,22831,198,0001,044,0002,113,536