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 10, 2026 13:22Victor MerckléVictor MerckléScore: 4,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:224,50645,281,48536,318,0001,083,0002,113,536
2Jun 10, 2026 13:224,51845,483,82236,418,0001,089,0002,113,536
3Jun 10, 2026 13:224,52045,351,77336,437,0001,080,0002,113,536
4Jun 10, 2026 13:224,52145,159,19936,455,0001,071,0002,113,536
5Jun 10, 2026 13:224,53645,039,13136,605,0001,047,0002,113,536
6Jun 10, 2026 13:224,65846,264,87637,656,0001,013,0002,113,536
7Jun 10, 2026 13:224,72446,842,96938,157,0001,056,0002,113,536
8Jun 10, 2026 13:224,72946,804,97838,181,0001,070,0002,113,536
9Jun 10, 2026 13:224,91948,188,39439,793,0001,039,0002,113,536