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:34Advait IyerAdvait IyerScore: 56,223Success
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:3456,198499,951,055465,446,0001,000,0002,289,664
2Jan 13, 2025 16:3456,206495,667,714465,510,0001,001,0002,289,664
3Jan 13, 2025 16:3456,207491,330,119465,516,0001,001,0002,289,664
4Jan 13, 2025 16:3456,222496,834,342464,648,0001,998,0002,289,664
5Jan 13, 2025 16:3456,223496,566,412465,651,000999,0002,273,280
6Jan 13, 2025 16:3456,224498,977,068465,660,000999,0002,289,664
7Jan 13, 2025 16:3456,224497,158,771464,662,0001,998,0002,289,664
8Jan 13, 2025 16:3456,225492,974,350464,669,0001,998,0002,289,664
9Jan 13, 2025 16:3456,228496,074,321464,693,0001,998,0002,269,184