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 5, 2026 13:44Kevin HeaveyKevin HeaveyScore: 29,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:4529,007250,269,632155,016,00085,743,0002,117,632
2Jul 5, 2026 13:4529,112251,186,452155,039,00086,596,0002,117,632
3Jul 5, 2026 13:4529,139251,349,892155,020,00086,836,0002,117,632
4Jul 5, 2026 13:4529,169251,632,344154,970,00087,135,0002,117,632
5Jul 5, 2026 13:4529,200251,835,489155,011,00087,355,0002,117,632
6Jul 5, 2026 13:4529,915257,860,228159,232,00089,065,0002,117,632
7Jul 5, 2026 13:4530,763264,937,375169,817,00085,518,0002,117,632
8Jul 5, 2026 13:4531,233268,769,914173,694,00085,548,0002,117,632
9Jul 5, 2026 13:4531,370269,918,315173,768,00086,610,0002,117,632