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 14, 2026 23:37Kevin HeaveyKevin HeaveyScore: 3,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:383,69040,301,10029,609,0001,021,0002,117,632
2Jul 14, 2026 23:383,69840,291,57529,476,0001,219,0002,117,632
3Jul 14, 2026 23:383,69940,366,90529,489,0001,220,0002,117,632
4Jul 14, 2026 23:383,70140,353,67429,458,0001,266,0002,117,632
5Jul 14, 2026 23:383,70240,360,61629,650,0001,083,0002,117,632
6Jul 14, 2026 23:383,71640,512,22629,824,0001,024,0002,117,632
7Jul 14, 2026 23:383,72141,865,93929,869,0001,022,0002,117,632
8Jul 14, 2026 23:383,76540,940,44929,948,0001,306,0002,117,632
9Jul 14, 2026 23:383,79341,219,90330,457,0001,032,0002,117,632