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 28, 2026 09:39ManuManuScore: 89,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 09:3989,309764,963,922512,492,000228,773,0002,293,760
2Feb 28, 2026 09:3989,402767,076,726513,028,000229,012,0002,482,176
3Feb 28, 2026 09:3989,423766,616,839511,455,000230,754,0002,289,664
4Feb 28, 2026 09:3989,481771,356,070512,786,000229,904,0002,506,752
5Feb 28, 2026 09:3989,530767,550,415512,382,000230,721,0002,473,984
6Feb 28, 2026 09:3989,541763,625,607511,442,000231,747,0002,289,664
7Feb 28, 2026 09:3989,793767,594,170512,508,000232,776,0002,424,832
8Feb 28, 2026 09:3989,899770,217,894512,427,000233,738,0002,289,664
9Feb 28, 2026 09:3990,141782,249,496512,434,000235,740,0002,379,776