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 02:17Tejas G.Tejas G.Score: 7,367Success
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 02:177,21686,942,89757,896,0001,996,0002,379,776
2Nov 5, 2025 02:177,22183,688,21458,940,000998,0002,289,664
3Nov 5, 2025 02:177,28189,500,15360,432,00002,289,664
4Nov 5, 2025 02:177,36784,091,92860,140,0001,002,0002,379,776
5Nov 5, 2025 02:177,37083,449,38759,167,0002,005,0002,289,664
6Nov 5, 2025 02:177,42089,689,12060,573,0001,009,0002,265,088