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 17, 2026 16:02Kevin HeaveyKevin HeaveyScore: 3,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 16:043,63739,986,80929,145,0001,043,0002,117,632
2Jul 17, 2026 16:043,65240,082,55329,275,0001,044,0002,117,632
3Jul 17, 2026 16:043,65940,088,64429,329,0001,042,0002,117,632
4Jul 17, 2026 16:043,66140,167,43129,344,0001,050,0002,117,632
5Jul 17, 2026 16:043,75240,990,65430,107,0001,042,0002,117,632
6Jul 17, 2026 16:043,75640,902,31529,944,0001,237,0002,117,632
7Jul 17, 2026 16:043,78341,272,67930,354,0001,046,0002,117,632
8Jul 17, 2026 16:043,84241,662,02930,847,0001,048,0002,117,632
9Jul 17, 2026 16:043,93742,483,85531,663,0001,020,0002,117,632