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 4, 2026 22:51Joshua MontrossJoshua MontrossScore: 22,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:5122,858199,260,378188,664,0001,058,0002,113,536
2Jul 4, 2026 22:5122,859199,165,600188,731,0001,003,0002,113,536
3Jul 4, 2026 22:5122,874199,256,068188,777,0001,079,0002,113,536
4Jul 4, 2026 22:5122,883200,105,352188,832,0001,105,0002,113,536
5Jul 4, 2026 22:5122,889199,377,058188,900,0001,085,0002,113,536
6Jul 4, 2026 22:5123,255202,449,029191,829,0001,188,0002,113,536
7Jul 4, 2026 22:5123,259202,482,826192,041,0001,011,0002,113,536
8Jul 4, 2026 22:5123,262202,530,020192,047,0001,028,0002,113,536
9Jul 4, 2026 22:5123,423204,015,809193,238,0001,178,0002,113,536