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 22, 2026 19:49wnwnScore: 4,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 19:494,67975,060,22536,847,0001,991,0002,277,376
2Feb 22, 2026 19:494,69058,518,45736,929,0001,996,0002,269,184
3Feb 22, 2026 19:494,69160,890,71536,942,0001,996,0002,277,376
4Feb 22, 2026 19:494,69862,076,31536,995,0001,999,0002,277,376
5Feb 22, 2026 19:494,71060,414,85837,089,0002,004,0002,531,328
6Feb 22, 2026 19:494,75862,915,59638,481,0001,012,0002,535,424
7Feb 22, 2026 19:494,77969,991,34938,647,0001,017,0002,490,368
8Feb 22, 2026 19:494,80764,060,75937,902,0001,994,0002,490,368
9Feb 22, 2026 19:498,68994,959,77570,115,0002,003,0002,494,464