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 24, 2026 19:05Victor MerckléVictor MerckléScore: 4,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 19:064,51145,096,30736,344,0001,104,0002,117,632stderr
2Jun 24, 2026 19:064,51445,148,90536,369,0001,103,0002,117,632stderr
3Jun 24, 2026 19:064,52045,598,31136,412,0001,112,0002,117,632stderr
4Jun 24, 2026 19:064,52345,240,44236,440,0001,107,0002,117,632stderr
5Jun 24, 2026 19:064,52345,211,05836,455,0001,091,0002,117,632stderr
6Jun 24, 2026 19:064,52545,248,79036,450,0001,113,0002,117,632stderr
7Jun 24, 2026 19:064,54045,385,85836,558,0001,131,0002,117,632stderr
8Jun 24, 2026 19:064,73246,934,47738,180,0001,100,0002,117,632stderr
9Jun 24, 2026 19:064,96348,886,76340,160,0001,039,0002,117,632stderr