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 12, 2026 15:24Victor MerckléVictor MerckléScore: 5,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 15:255,40152,482,27243,769,0001,064,0002,113,536
2Jun 12, 2026 15:255,40652,812,66043,806,0001,066,0002,113,536
3Jun 12, 2026 15:255,40652,493,32343,795,0001,075,0002,113,536
4Jun 12, 2026 15:255,41152,491,60243,860,0001,058,0002,113,536
5Jun 12, 2026 15:255,43352,673,39244,075,0001,023,0002,113,536
6Jun 12, 2026 15:255,44452,779,44044,152,0001,038,0002,113,536
7Jun 12, 2026 15:255,44553,217,07044,113,0001,085,0002,113,536
8Jun 12, 2026 15:255,59654,044,97345,445,0001,004,0002,113,536
9Jun 12, 2026 15:255,66155,949,74645,979,0001,009,0002,113,536