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 5, 2025 01:36Tejas G.Tejas G.Score: 7,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 01:367,44694,146,34459,810,0001,993,0002,289,664
2Nov 5, 2025 01:367,45784,298,08559,901,0001,996,0002,289,664
3Nov 5, 2025 01:367,48487,248,16860,111,0002,003,0002,281,472
4Nov 5, 2025 01:367,53091,143,12061,493,0001,008,0002,289,664
5Nov 5, 2025 01:367,58287,754,82260,933,0001,997,0002,289,664
6Nov 5, 2025 01:367,59191,002,04461,006,0002,000,0002,289,664