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 3, 2026 19:55Josu San MartinJosu San MartinScore: 14,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:5514,826132,452,814120,903,0002,158,0002,117,632
2Jul 3, 2026 19:5514,836132,502,005120,931,0002,214,0002,117,632
3Jul 3, 2026 19:5514,877132,810,006121,175,0002,309,0002,117,632
4Jul 3, 2026 19:5514,966133,637,265122,051,0002,173,0002,117,632
5Jul 3, 2026 19:5514,984133,772,349122,085,0002,290,0002,117,632
6Jul 3, 2026 19:5514,985133,798,645122,100,0002,283,0002,117,632
7Jul 3, 2026 19:5514,987133,778,422122,178,0002,218,0002,117,632
8Jul 3, 2026 19:5514,989133,824,211122,131,0002,279,0002,117,632
9Jul 3, 2026 19:5515,353136,757,929125,154,0002,282,0002,117,632