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 00:04AntonAntonScore: 61,931Success
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 00:0461,902543,147,976510,790,0002,998,0002,289,664
2Nov 5, 2025 00:0461,921538,044,899510,943,0002,999,0002,293,760
3Nov 5, 2025 00:0461,926539,454,962512,984,000999,0002,433,024
4Nov 5, 2025 00:0461,926542,657,667510,987,0002,999,0002,437,120
5Nov 5, 2025 00:0461,931546,047,371512,028,0002,000,0002,441,216
6Nov 5, 2025 00:0461,933543,159,085511,041,0003,000,0002,408,448
7Nov 5, 2025 00:0461,940540,782,631512,103,0002,000,0002,551,808
8Nov 5, 2025 00:0461,943540,154,768511,128,0003,000,0002,306,048
9Nov 5, 2025 00:0461,948541,720,029512,167,0002,000,0002,301,952