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 listJun 22, 2025 08:41infiKNIGHTeinfiKNIGHTeScore: 332,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 08:41332,7612,784,890,4112,700,940,00060,976,0002,285,568
2Jun 22, 2025 08:41332,8282,788,983,4842,697,510,00064,964,0002,273,280
3Jun 22, 2025 08:41332,8552,786,792,5322,690,732,00071,966,0002,273,280
4Jun 22, 2025 08:41332,8992,790,153,4662,694,089,00068,976,0002,273,280
5Jun 22, 2025 08:41332,9652,787,661,1262,699,642,00063,967,0002,273,280
6Jun 22, 2025 08:41332,9702,791,256,1602,685,687,00077,961,0002,273,280
7Jun 22, 2025 08:41333,0162,786,248,6352,686,064,00077,972,0002,379,776
8Jun 22, 2025 08:41334,0502,798,679,0162,713,644,00058,970,0002,273,280
9Jun 22, 2025 08:41336,7342,817,374,2682,731,921,00062,975,0002,273,280