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 25, 2025 18:33Mikhail ShirokovMikhail ShirokovScore: 46,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 18:3346,444413,663,901384,484,0001,001,0002,269,184
2Jan 25, 2025 18:3346,447412,087,501384,512,0001,001,0002,445,312
3Jan 25, 2025 18:3346,467415,660,909383,681,0001,998,0002,531,328
4Jan 25, 2025 18:3346,469411,782,727383,694,0001,998,0002,527,232
5Jan 25, 2025 18:3346,470410,966,811383,699,0001,998,0002,531,328
6Jan 25, 2025 18:3346,470413,162,126383,704,0001,998,0002,441,216
7Jan 25, 2025 18:3346,482413,542,359383,803,0001,998,0002,449,408
8Jan 25, 2025 18:3346,490417,953,491383,865,0001,999,0002,441,216
9Jan 25, 2025 18:3346,505417,833,664383,994,0001,999,0002,281,472