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 26, 2026 06:58Victor MerckléVictor MerckléScore: 7,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:597,49869,921,98861,124,0001,116,0002,113,536
2Jun 26, 2026 06:597,50269,932,90861,163,0001,108,0002,113,536
3Jun 26, 2026 06:597,50569,964,35361,197,0001,101,0002,113,536
4Jun 26, 2026 06:597,50770,009,78661,179,0001,133,0002,113,536
5Jun 26, 2026 06:597,57070,506,56661,810,0001,023,0002,113,536
6Jun 26, 2026 06:597,62970,997,42262,230,0001,093,0002,113,536
7Jun 26, 2026 06:597,64271,083,06362,306,0001,130,0002,113,536
8Jun 26, 2026 06:597,64871,163,73862,467,0001,015,0002,113,536
9Jun 26, 2026 06:597,66171,297,39062,482,0001,106,0002,113,536