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 17, 2026 10:49DavidDavidScore: 61,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 10:5061,200517,072,256506,963,0001,003,0002,113,536
2Jun 17, 2026 10:5061,205517,052,677507,003,0001,005,0002,113,536
3Jun 17, 2026 10:5061,210517,215,266507,047,0001,003,0002,113,536
4Jun 17, 2026 10:5061,233517,199,473507,238,0001,004,0002,113,536
5Jun 17, 2026 10:5061,245517,409,527506,312,0002,025,0002,113,536
6Jun 17, 2026 10:5061,439519,308,179508,944,0001,003,0002,113,536
7Jun 17, 2026 10:5061,442519,015,482508,971,0001,004,0002,113,536
8Jun 17, 2026 10:5061,453519,139,642509,057,0001,004,0002,113,536
9Jun 17, 2026 10:5061,461519,154,482509,126,0001,004,0002,113,536