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:32Saif Al-HarthiSaif Al-HarthiScore: 24,622Success
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:3424,552213,288,285201,759,0002,024,0002,117,632
2Jun 30, 2026 13:3424,563213,343,348201,860,0002,015,0002,117,632
3Jun 30, 2026 13:3424,609214,022,235202,197,0002,059,0002,117,632
4Jun 30, 2026 13:3424,619213,780,644202,312,0002,031,0002,117,632
5Jun 30, 2026 13:3424,622214,224,242202,252,0002,115,0002,117,632
6Jun 30, 2026 13:3424,679215,762,122202,763,0002,073,0002,117,632
7Jun 30, 2026 13:3424,717214,581,179203,030,0002,123,0002,117,632
8Jun 30, 2026 13:3424,790215,280,737203,724,0002,034,0002,117,632
9Jun 30, 2026 13:3425,434220,548,365209,054,0002,053,0002,117,632