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 listJun 30, 2026 13:17Andrey LikhachevAndrey LikhachevScore: 12,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 13:1711,339103,449,30493,052,0001,062,0002,117,632
2Jun 30, 2026 13:1711,339103,449,66892,972,0001,145,0002,117,632
3Jun 30, 2026 13:1712,543113,586,723103,021,0001,091,0002,117,632
4Jun 30, 2026 13:1712,544113,446,729103,043,0001,073,0002,117,632
5Jun 30, 2026 13:1712,548113,473,379103,093,0001,063,0002,117,632
6Jun 30, 2026 13:1712,556113,550,362103,146,0001,076,0002,117,632
7Jun 30, 2026 13:1712,557113,564,093103,127,0001,103,0002,117,632
8Jun 30, 2026 13:1712,567113,666,620103,180,0001,133,0002,117,632
9Jun 30, 2026 13:1712,571113,683,573103,199,0001,144,0002,117,632