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 13, 2026 08:30Victor MerckléVictor MerckléScore: 7,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 08:307,92173,022,80764,734,0001,015,0002,113,536
2May 13, 2026 08:307,92374,974,44364,732,0001,037,0002,113,536
3May 13, 2026 08:307,92374,747,06464,737,0001,024,0002,113,536
4May 13, 2026 08:307,92474,462,14264,745,0001,027,0002,113,536
5May 13, 2026 08:307,92875,102,53764,748,0001,058,0002,113,536
6May 13, 2026 08:307,92877,689,89064,764,0001,039,0002,113,536
7May 13, 2026 08:307,92975,095,78864,768,0001,049,0002,113,536
8May 13, 2026 08:307,93574,037,27164,854,0001,008,0002,113,536
9May 13, 2026 08:307,94874,395,18564,837,0001,138,0002,113,536