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 listMar 18, 2026 15:54shartgepettoshartgepettoScore: 6,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 15:545,98283,177,13046,608,0003,039,0002,478,080
2Mar 18, 2026 15:545,99879,248,49646,800,0002,987,0002,502,656
3Mar 18, 2026 15:546,00076,093,09445,820,0003,984,0002,469,888
4Mar 18, 2026 15:546,00577,654,63648,827,0001,017,0002,453,504
5Mar 18, 2026 15:546,02083,168,63546,968,0002,998,0002,486,272
6Mar 18, 2026 15:546,04175,505,89646,127,0004,011,0002,392,064
7Mar 18, 2026 15:546,05272,918,33946,212,0004,018,0002,498,560
8Mar 18, 2026 15:546,06674,283,18348,334,0002,013,0002,498,560
9Mar 18, 2026 15:546,09483,307,58848,556,0002,023,0002,387,968