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 listSep 25, 2025 11:58Daniel MastalerzDaniel MastalerzScore: 63,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 11:5863,447554,388,185525,608,000999,0002,273,280
2Sep 25, 2025 11:5863,451554,507,110525,641,000999,0002,273,280
3Sep 25, 2025 11:5863,482554,016,407524,904,0001,999,0002,396,160
4Sep 25, 2025 11:5863,482549,947,857525,905,000999,0002,273,280
5Sep 25, 2025 11:5863,497550,372,361526,027,0001,000,0002,273,280
6Sep 25, 2025 11:5863,498554,857,050525,032,0002,000,0002,396,160
7Sep 25, 2025 11:5863,528561,703,122526,286,0001,000,0002,273,280
8Sep 25, 2025 11:5863,530556,881,420526,302,0001,000,0002,273,280
9Sep 25, 2025 11:5863,537554,441,642526,353,0001,000,0002,392,064