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 4, 2025 17:55caandocaandoScore: 5,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 17:555,88674,597,38446,860,0001,994,0002,285,568
2Nov 4, 2025 17:555,89574,009,60847,934,000998,0002,273,280
3Nov 4, 2025 17:555,92075,746,92547,128,0002,005,0002,285,568
4Nov 4, 2025 17:555,94269,602,77247,305,0002,012,0002,285,568
5Nov 4, 2025 17:556,00773,007,00447,865,0001,994,0002,285,568
6Nov 4, 2025 17:556,03876,610,83248,113,0002,004,0002,285,568