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 listSep 17, 2026 17:27C21C21Score: 13,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 17:2913,106119,244,840107,620,0001,160,0002,113,536
2Sep 17, 2026 17:2913,110119,154,758107,629,0001,188,0002,113,536
3Sep 17, 2026 17:2913,116119,468,587107,611,0001,258,0002,113,536
4Sep 17, 2026 17:2913,118119,480,406107,608,0001,276,0002,113,536
5Sep 17, 2026 17:2913,120119,241,641107,742,0001,158,0002,113,536
6Sep 17, 2026 17:2913,121119,604,375107,638,0001,271,0002,113,536
7Sep 17, 2026 17:2913,128119,438,913107,799,0001,168,0002,113,536
8Sep 17, 2026 17:2913,134119,369,635107,892,0001,121,0002,113,536
9Sep 17, 2026 17:2913,229120,099,427108,637,0001,169,0002,113,536