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 09:35DavidDavidScore: 33,679Success
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 09:3533,337285,751,906275,695,0001,004,0002,113,536
2Jun 17, 2026 09:3533,631297,224,200278,136,0001,004,0002,113,536
3Jun 17, 2026 09:3533,658288,253,916278,358,0001,004,0002,113,536
4Jun 17, 2026 09:3533,675288,487,756278,508,0001,002,0002,113,536
5Jun 17, 2026 09:3533,679289,098,750278,538,0001,004,0002,113,536
6Jun 17, 2026 09:3533,684288,770,206278,581,0001,003,0002,113,536
7Jun 17, 2026 09:3533,696288,687,637278,674,0001,003,0002,113,536
8Jun 17, 2026 09:3533,700288,724,422278,707,0001,005,0002,113,536
9Jun 17, 2026 09:3533,705288,815,743278,748,0001,004,0002,113,536