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 listOct 13, 2025 03:06CheranMahalingamCheranMahalingamScore: 49,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2025 03:0649,154429,987,059405,976,0001,999,0002,285,568
2Oct 13, 2025 03:0649,156431,072,874405,993,0001,999,0002,285,568
3Oct 13, 2025 03:0649,159436,947,276407,022,0001,000,0002,269,184
4Oct 13, 2025 03:0649,161435,418,764406,037,0002,000,0002,273,280
5Oct 13, 2025 03:0649,162430,380,486406,047,0002,000,0002,285,568
6Oct 13, 2025 03:0649,166431,734,064407,076,0001,000,0002,285,568
7Oct 13, 2025 03:0649,166435,509,870407,075,0001,000,0002,363,392
8Oct 13, 2025 03:0649,173435,141,141406,140,0002,000,0002,285,568
9Oct 13, 2025 03:0649,181437,439,481406,202,0002,000,0002,519,040