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 19:22Kevin HeaveyKevin HeaveyScore: 3,947Success
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 19:393,67340,368,34529,442,0001,048,0002,113,536
2Jul 17, 2026 19:393,91742,372,53731,470,0001,042,0002,113,536
3Jul 17, 2026 19:393,94142,522,70331,669,0001,044,0002,113,536
4Jul 17, 2026 19:393,94442,549,32031,696,0001,044,0002,113,536
5Jul 17, 2026 19:393,94742,528,59731,721,0001,043,0002,113,536
6Jul 17, 2026 19:393,95742,712,16931,798,0001,046,0002,113,536
7Jul 17, 2026 19:393,96142,694,80531,833,0001,044,0002,113,536
8Jul 17, 2026 19:393,96543,371,28831,870,0001,042,0002,113,536
9Jul 17, 2026 19:393,96842,859,58831,893,0001,043,0002,113,536