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 listNov 30, 2025 18:42Rajarshi BasuRajarshi BasuScore: 13,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 18:4213,582136,489,248111,736,000997,0002,289,664
2Nov 30, 2025 18:4213,583146,705,078110,740,0001,995,0002,289,664
3Nov 30, 2025 18:4213,583138,856,854110,741,0001,995,0002,265,088
4Nov 30, 2025 18:4213,583142,743,842111,743,000997,0002,289,664
5Nov 30, 2025 18:4213,584138,948,669110,750,0001,995,0002,273,280
6Nov 30, 2025 18:4213,586139,844,460111,765,000997,0002,289,664
7Nov 30, 2025 18:4213,589144,085,975110,791,0001,996,0002,289,664
8Nov 30, 2025 18:4213,657139,040,259112,346,0001,003,0002,289,664
9Nov 30, 2025 18:4213,658138,475,999112,355,0001,003,0002,289,664