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 listDec 30, 2024 23:37tkaltkalScore: 69,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2024 23:3769,742601,131,342517,876,00060,985,0002,273,280
2Dec 30, 2024 23:3769,865608,805,334524,892,00054,988,0002,273,280
3Dec 30, 2024 23:3769,902608,297,694524,166,00056,017,0002,269,184
4Dec 30, 2024 23:3769,907602,660,698526,205,00054,021,0002,273,280
5Dec 30, 2024 23:3769,946610,755,741526,595,00053,958,0002,273,280
6Dec 30, 2024 23:3770,000600,657,297516,998,00063,999,0002,273,280
7Dec 30, 2024 23:3770,064606,787,925518,584,00062,949,0002,281,472
8Dec 30, 2024 23:3770,069615,926,784521,617,00059,955,0002,281,472
9Dec 30, 2024 23:3770,085610,709,391525,736,00055,971,0002,273,280