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 listJan 13, 2025 16:24Advait IyerAdvait IyerScore: 60,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 16:2460,823533,246,568503,829,000999,0002,265,088
2Jan 13, 2025 16:2460,870531,778,735504,220,0001,000,0002,269,184
3Jan 13, 2025 16:2460,873532,374,819503,242,0002,000,0002,277,376
4Jan 13, 2025 16:2460,888533,482,429505,374,00002,265,088
5Jan 13, 2025 16:2460,892536,425,486505,407,00002,367,488
6Jan 13, 2025 16:2460,897531,737,168504,449,000998,0002,289,664
7Jan 13, 2025 16:2460,901531,865,444504,483,000998,0002,289,664
8Jan 13, 2025 16:2460,905531,275,516503,515,0001,998,0002,289,664
9Jan 13, 2025 16:2460,909532,391,470504,544,000999,0002,269,184