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:33DavidDavidScore: 33,689Success
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:3333,300285,432,087275,389,0001,004,0002,113,536
2Jun 17, 2026 09:3333,357286,059,031274,834,0002,033,0002,113,536
3Jun 17, 2026 09:3333,672288,528,321278,475,0001,003,0002,113,536
4Jun 17, 2026 09:3333,679288,566,005278,525,0001,018,0002,113,536
5Jun 17, 2026 09:3333,689288,542,258278,618,0001,003,0002,113,536
6Jun 17, 2026 09:3333,691288,595,930278,636,0001,004,0002,113,536
7Jun 17, 2026 09:3333,692288,799,626278,647,0001,003,0002,113,536
8Jun 17, 2026 09:3333,702288,900,572278,730,0001,003,0002,113,536
9Jun 17, 2026 09:3333,709288,799,965278,787,0001,003,0002,113,536