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 listJul 9, 2026 05:52Victor MerckléVictor MerckléScore: 17,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 05:5316,438144,584,745135,327,0001,114,0002,117,632stderr
2Jul 9, 2026 05:5316,491144,760,627135,855,0001,028,0002,117,632stderr
3Jul 9, 2026 05:5316,586145,567,139136,640,0001,030,0002,117,632stderr
4Jul 9, 2026 05:5317,893156,631,991147,408,0001,106,0002,117,632stderr
5Jul 9, 2026 05:5317,914156,689,783147,585,0001,104,0002,117,632stderr
6Jul 9, 2026 05:5317,944156,814,115147,886,0001,055,0002,117,632stderr
7Jul 9, 2026 05:5317,959156,984,711147,944,0001,118,0002,117,632stderr
8Jul 9, 2026 05:5317,974157,160,454148,182,0001,005,0002,117,632stderr
9Jul 9, 2026 05:5318,085158,066,404149,046,0001,061,0002,117,632stderr