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 24, 2025 12:56Jeffrey JianJeffrey JianScore: 102,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 12:56102,126878,054,631789,669,00057,975,0002,383,872
2Nov 24, 2025 12:56102,220872,648,372793,466,00054,963,0002,396,160
3Nov 24, 2025 12:56102,280870,111,891791,931,00056,995,0002,392,064
4Nov 24, 2025 12:56102,290874,726,975792,011,00057,000,0002,260,992
5Nov 24, 2025 12:56102,293870,217,046790,029,00059,002,0002,519,040
6Nov 24, 2025 12:56102,413874,755,365786,028,00064,002,0002,260,992
7Nov 24, 2025 12:56102,433883,713,566787,184,00063,014,0002,519,040
8Nov 24, 2025 12:56102,865876,541,431790,794,00062,983,0002,383,872
9Nov 24, 2025 12:56103,064882,945,239788,479,00066,955,0002,260,992