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 26, 2024 00:13haiwwkeshaiwwkesScore: 1,320,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2024 00:131,309,29810,901,527,30810,795,203,00071,968,0002,281,472
2Oct 26, 2024 00:131,316,57410,959,574,80410,863,591,00063,974,0002,281,472
3Oct 26, 2024 00:131,316,64010,959,224,51410,860,144,00067,969,0002,281,472
4Oct 26, 2024 00:131,319,37210,983,392,20710,880,825,00069,966,0002,281,472
5Oct 26, 2024 00:131,320,03910,984,856,73010,879,360,00076,967,0002,281,472
6Oct 26, 2024 00:131,320,43310,991,710,49910,897,618,00061,975,0002,289,664
7Oct 26, 2024 00:131,322,24711,000,632,62110,895,682,00078,968,0002,281,472
8Oct 26, 2024 00:131,323,44311,013,821,45010,906,614,00077,961,0002,289,664
9Oct 26, 2024 00:131,330,53911,073,255,13910,994,495,00048,975,0002,281,472