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 listJun 28, 2026 13:46Victor MerckléVictor MerckléScore: 4,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 13:474,40744,377,44035,472,0001,113,0002,113,536
2Jun 28, 2026 13:474,41544,475,48935,570,0001,075,0002,113,536
3Jun 28, 2026 13:474,42544,451,60135,662,0001,070,0002,113,536
4Jun 28, 2026 13:474,44445,968,86335,850,0001,037,0002,113,536
5Jun 28, 2026 13:474,46644,796,54236,064,0001,005,0002,113,536
6Jun 28, 2026 13:474,46944,787,35336,064,0001,031,0002,113,536
7Jun 28, 2026 13:474,47344,918,13336,054,0001,075,0002,113,536
8Jun 28, 2026 13:474,52645,328,76936,566,0001,007,0002,113,536
9Jun 28, 2026 13:474,58945,813,07037,072,0001,018,0002,113,536