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 listAug 27, 2026 05:37Victor MerckléVictor MerckléScore: 5,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:384,94049,431,19839,972,0001,035,0002,113,536
2Aug 27, 2026 05:384,96358,312,76940,171,0001,024,0002,113,536
3Aug 27, 2026 05:384,97249,680,02640,238,0001,032,0002,113,536
4Aug 27, 2026 05:384,97249,675,12940,221,0001,049,0002,113,536
5Aug 27, 2026 05:385,00949,929,03740,376,0001,203,0002,113,536
6Aug 27, 2026 05:385,07350,568,39741,089,0001,020,0002,113,536
7Aug 27, 2026 05:385,17551,217,15341,909,0001,051,0002,113,536
8Aug 27, 2026 05:385,19651,507,36242,086,0001,045,0002,113,536
9Aug 27, 2026 05:385,26954,022,27942,688,0001,047,0002,113,536