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 listMay 23, 2026 22:31Maya RebholzMaya RebholzScore: 8,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 22:318,45682,304,58063,961,0006,225,0002,117,632
2May 23, 2026 22:318,45781,603,20863,914,0006,286,0002,117,632
3May 23, 2026 22:318,45980,601,39963,769,0006,445,0002,117,632
4May 23, 2026 22:318,47880,225,77163,918,0006,452,0002,117,632
5May 23, 2026 22:318,48480,229,57364,304,0006,119,0002,121,728
6May 23, 2026 22:318,49082,435,48464,090,0006,385,0002,117,632
7May 23, 2026 22:318,51782,043,96964,158,0006,536,0002,117,632
8May 23, 2026 22:318,54682,858,27164,327,0006,613,0002,117,632
9May 23, 2026 22:318,55784,089,16064,571,0006,459,0002,117,632