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 listFeb 19, 2026 22:07Daniel MastalerzDaniel MastalerzScore: 6,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:076,24382,386,28848,827,0002,989,0002,519,040
2Feb 19, 2026 22:076,24481,396,43349,793,0002,032,0002,273,280
3Feb 19, 2026 22:076,24780,054,22947,865,0003,988,0002,310,144
4Feb 19, 2026 22:076,27276,979,00248,052,0004,004,0002,277,376
5Feb 19, 2026 22:076,32181,872,61349,440,0003,026,0002,322,432
6Feb 19, 2026 22:076,38179,562,96848,967,0003,997,0002,265,088