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 22, 2026 20:08lipapipalipapipaScore: 42,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 20:0842,059378,598,555347,086,0002,000,0002,273,280
2Jan 22, 2026 20:0842,134379,572,158347,714,0001,998,0002,269,184
3Jan 22, 2026 20:0842,213371,448,588350,370,00002,269,184
4Jan 22, 2026 20:0842,215376,692,602349,384,0001,001,0002,269,184
5Jan 22, 2026 20:0842,280376,353,451348,926,0001,999,0002,269,184
6Jan 22, 2026 20:0842,290381,029,222350,011,0001,000,0002,510,848
7Jan 22, 2026 20:0842,561385,552,852352,256,0001,000,0002,269,184
8Jan 22, 2026 20:0842,638381,155,553351,898,0001,999,0002,269,184
9Jan 22, 2026 20:0842,690379,225,919353,329,0001,000,0002,269,184