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 listMar 30, 2026 01:32zielajzielajScore: 3,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 01:323,44955,182,73627,608,0001,022,0002,420,736
2Mar 30, 2026 01:323,45257,590,68427,632,0001,023,0002,433,024
3Mar 30, 2026 01:323,54853,686,59728,437,0001,015,0002,437,120
4Mar 30, 2026 01:323,56859,255,75728,597,0001,021,0002,510,848
5Mar 30, 2026 01:323,65452,970,89429,319,0001,011,0002,510,848
6Mar 30, 2026 01:323,72252,193,71429,896,000996,0002,269,184