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 2, 2025 09:37Tan Lip WeiTan Lip WeiScore: 6,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 09:376,83885,275,56344,809,00011,949,0002,506,752
2Nov 2, 2025 09:376,91386,370,98744,518,00012,860,0002,371,584
3Nov 2, 2025 09:376,91588,095,62547,500,0009,896,0002,379,776
4Nov 2, 2025 09:376,91781,681,11243,556,00013,858,0002,379,776
5Nov 2, 2025 09:376,92081,221,32346,546,00010,893,0002,420,736
6Nov 2, 2025 09:376,92688,722,75344,601,00012,884,0002,301,952
7Nov 2, 2025 09:376,99887,558,08546,065,00012,017,0002,473,984
8Nov 2, 2025 09:377,01387,760,01146,167,00012,043,0002,383,872
9Nov 2, 2025 09:377,05788,005,37745,667,00012,906,0002,514,944
10Nov 2, 2025 09:377,16584,948,34748,569,00010,903,0002,416,640
11Nov 2, 2025 09:377,21487,510,68448,901,00010,977,0002,453,504
12Nov 2, 2025 09:377,43988,181,62547,800,00013,941,0002,510,848