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 listMar 12, 2026 11:39zielajzielajScore: 3,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 11:393,76252,299,00130,219,0001,007,0002,510,848
2Mar 12, 2026 11:393,77049,985,43930,282,0001,009,0002,527,232
3Mar 12, 2026 11:393,79155,648,48931,463,00002,351,104
4Mar 12, 2026 11:393,91255,420,19832,468,00002,269,184
5Mar 12, 2026 11:393,93562,372,56932,658,00002,355,200
6Mar 12, 2026 11:393,95764,436,15531,852,000995,0002,531,328