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 22:33Kevin HeaveyKevin HeaveyScore: 3,736Success
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 22:343,70640,310,89429,741,0001,021,0002,117,632
2Jul 14, 2026 22:343,70740,404,16029,745,0001,027,0002,117,632
3Jul 14, 2026 22:343,71240,458,77429,775,0001,038,0002,117,632
4Jul 14, 2026 22:343,71340,471,06529,793,0001,027,0002,117,632
5Jul 14, 2026 22:343,73640,708,46829,985,0001,030,0002,117,632
6Jul 14, 2026 22:343,78341,026,71730,355,0001,044,0002,117,632
7Jul 14, 2026 22:343,79341,057,35330,438,0001,046,0002,117,632
8Jul 14, 2026 22:343,80741,184,78930,560,0001,044,0002,117,632
9Jul 14, 2026 22:343,81741,272,20630,639,0001,047,0002,117,632