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 listSep 21, 2026 18:04C21C21Score: 19,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 18:0419,310170,699,332159,096,0001,182,0002,113,536
2Sep 21, 2026 18:0419,315170,766,889159,146,0001,171,0002,113,536
3Sep 21, 2026 18:0419,315170,780,401159,090,0001,229,0002,113,536
4Sep 21, 2026 18:0419,321170,821,804159,142,0001,227,0002,113,536
5Sep 21, 2026 18:0419,325171,593,078159,231,0001,169,0002,113,536
6Sep 21, 2026 18:0419,326170,812,677159,172,0001,235,0002,113,536
7Sep 21, 2026 18:0419,341171,043,118159,527,0001,005,0002,113,536
8Sep 21, 2026 18:0419,586173,067,158161,314,0001,251,0002,113,536
9Sep 21, 2026 18:0419,736175,076,150162,586,0001,228,0002,113,536